Maximizing Wiener index of graphs with fixed maximum degree
نویسنده
چکیده
The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. Fischermann et al [5] characterized the trees which minimize the Wiener index among all trees with the maximum degree at most ∆. They also determined the trees which maximize the Wiener index, but in a much more restricted family of trees which have two distinct vertex degrees only. In this note, we fully solve the latter problem and determine the trees which maximize the Wiener index among all graphs with the maximum degree ∆. We also determine all graphs whose Wiener index differs by less than n−∆ from the maximum value.
منابع مشابه
Peripheral Wiener Index of a Graph
The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...
متن کاملMaximizing Kirchhoff index of unicyclic graphs with fixed maximum degree
The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. Its considerable applications are found in a variety of fields. In this paper, we determine the maximum value of Kirchhoff index among the unicyclic graphs with fixed number of vertices and maximum degree, and characterize the corresponding extremal graph.
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملThe Topological Indices of some Dendrimer Graphs
In this paper the Wiener and hyper Wiener index of two kinds of dendrimer graphs are determined. Using the Wiener index formula, the Szeged, Schultz, PI and Gutman indices of these graphs are also determined.
متن کاملWiener Indices of Balanced Binary Trees
Molecules and molecular compounds are often modeled by molecular graphs. One of the most widely known topological descriptor [6, 9] is the Wiener index named after chemist Harold Wiener [13]. The Wiener index of a graph G(V, E) is defined as W (G) = ∑ u,v∈V d(u, v), where d(u, v) is the distance between vertices u and v (minimum number of edges between u and v). A majority of the chemical appli...
متن کامل